منابع مشابه
Boolean Metric Spaces and Boolean Algebraic Varieties
The concepts of Boolean metric space and convex combination are used to characterize polynomial maps An −→ Am in a class of commutative Von Neumann regular rings including p-rings, that we have called CFG-rings. In those rings, the study of the category of algebraic varieties (i.e. sets of solutions to a finite number of polynomial equations with polynomial maps as morphisms) is equivalent to t...
متن کاملBoolean Vector Spaces
This article discusses the basic properties of finite-dimensional Boolean vector spaces and their linear transformations. We first introduce a natural Boolean-valued inner product and discuss orthonormal bases. We show that all bases are orthonormal and have the same cardinality. It is shown that the set of subspaces form an atomistic orthomodular poset. We then demonstrate that an operator tha...
متن کاملBoolean Functions Fitness Spaces
We investigate the distribution of performance of the Boolean functions of 3 Boolean inputs (particularly that of the parity functions), the always-on-6 and even-6 parity functions. We us enumeration, uniform Monte-Carlo random sampling and sampling random full trees. As expected XOR dramatically changes the fitness distributions. In all cases once some minimum size threshold has been exceeded,...
متن کاملComplexity of Linear Boolean Operators Complexity of Linear Boolean Operators
How to compute a linear Boolean operator by a small circuit using only unbounded fanin addition gates? Because this question is about one of the simplest and most basic circuit models, it has been considered by many authors since the early 1950s. This has led to a variety of upper and lower bound arguments—ranging from algebraic (determinant and matrix rigidity), to combinatorial (Ramsey proper...
متن کاملComplexity of Linear Boolean Operators
How to compute a linear Boolean operator by a small circuit using only unbounded fanin addition gates? Because this question is about one of the simplest and most basic circuit models, it has been considered by many authors since the early 1950s. This has led to a variety of upper and lower bound arguments—ranging from algebraic (determinant and matrix rigidity), to combinatorial (Ramsey proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1990
ISSN: 0001-8708
DOI: 10.1016/0001-8708(90)90008-b